Compiler for trapdoor security in searchable public key encryption with designated verifiers

The offline keyword guessing attack (KG attack) is a new security threat to the searchable public key encryption with designated verifier. Many techniques have been proposed to resist such an attack. However, all these techniques are only secure against the outside KG attackers (neither the server nor the receiver), and have not solved the problem that the KG attacker is the server. In this paper, we propose the IND-KGA-SERVER security which is a security model against the server for searchable public key encryption and is a necessary supplement to the security against KG attacks. Then based on the existence of IND-KGA secure dPEKS, the existence of CA, and the existence of strongly unforgeable and undeniable signatures, we demonstrate how to construct secure searchable public key encryptions when KG attacker is the server. Our solution is independent of the based IND-KGA secure scheme and is a compiler from IND-KGA security to INDKGA-SERVER security for searchable public key encryptions with designated verifier.